Recognizing majority on a one-way mesh

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Majority on a One-Way Mesh

The two-dimensional majority language is the set of all two-dimensional arrays with 0/1 entries in which there are more l 's than 0'5. We show that this language can be recognized by a two-dimensional bounded cellular automaton using only one-way communication between neighboring cells. The recognition can occur within diameter time.

متن کامل

On the Way to Water-tight Mesh

This paper presents a new approach to generate water-tight surface mesh. In comparison with the two famous water-tight mesh generation algorithms: Tight Cocone (Dey and Goswami, 2003) and Power Crust (Amenta, Choi and Kolluri, 2001), our method shows a significant quality on the resulted models due to the efficient preand postprocessing. We choose our previously published online mesh generation...

متن کامل

On complete one-way functions

Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete one-way function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post correspon...

متن کامل

On a Family of Minimal Candidate One-way Functions and One-way Permutations

In order to achieve computational workload equivalent to the exhaustive key search of an n-bit key for inversion of RSA or Diffie-Hellman one-way candidate functions the length of their arguments have to have from 10n to 60n bits. One-way functions based on Elliptic Curves in this moment are holding the record, demanding only 2n bits for their arguments. In this paper we propose a definition an...

متن کامل

Recognizing Majority-Rule Equilibrium In Spatial Voting Games

It is provably difficult (NP-complete) to determine whether a given point can be defeated in a majority-rule spatial voting game. Nevertheless, one can easily generate a point with the property that if any point cannot be defeated, then this point cannot be defeated. Our results suggest that majority-rule equilibrium can exist as a purely practical matter: when the number of voters and the dime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 1988

ISSN: 0020-0190

DOI: 10.1016/0020-0190(88)90083-x